HOME
PARTNERS
CONTACT
Computer Science and Engineering
Data Structures – 1
Experiments
Aim
Overview
Pretest
Defining the Expressions
Aim
Concept
Infix Expressions
Postfix Expressions
Quiz
Algorithm for Conversion without Stack
Infix to Postfix Conversion with Stack
Aim
Validation of Expressions Demo
Push and Pop Operations On Stack
The Whole Conversion
Push and Pop operations Practice
Quiz
The Whole Conversion Exercise
Evaluation of Postfix Expressions
Aim
Evaluation of Postfix Expression
Postfix Evaluation Exercise
Posttest
Further Readings/References
Feedback
Aim
Overview
Pretest
Defining the Expressions
Aim
Concept
Infix Expressions
Postfix Expressions
Quiz
Algorithm for Conversion without Stack
Infix to Postfix Conversion with Stack
Aim
Validation of Expressions Demo
Push and Pop Operations On Stack
The Whole Conversion
Push and Pop operations Practice
Quiz
The Whole Conversion Exercise
Evaluation of Postfix Expressions
Aim
Evaluation of Postfix Expression
Postfix Evaluation Exercise
Posttest
Further Readings/References
Feedback
Infix and Postfix
Choose difficulty:
Beginner
Intermediate
Advanced
1. What is the priority order of operators i.e. the order of precedence of operators
a: Priority(^) > Priority(/) > Priority(*) > Priority(+) >= Priority(-)
Explanation
Explanation
b: Priority(/) > Priority(^) > Priority(*) > Priority(+) >= Priority(-)
Explanation
Explanation
c: Priority(^) > Priority(*) > Priority(/) > Priority(+) >= Priority(-)
Explanation
Explanation
d: Priority(/) > Priority(*) > Priority(^) > Priority(+) >= Priority(-)
Explanation
Explanation
Submit Quiz
